Matrix-free multi-GPU Implementation of Elliptic Solvers for strongly anisotropic PDEs
نویسندگان
چکیده
Manycore chip architectures such as Graphics Processing Units (GPUs) have been shown to be highly e cient both in terms of total performance and small power consumption in many areas of Scientific Computing. However, implementing memory-bound applications such as elliptic solvers for large partial di↵erential equations (PDEs) remains a challenge. We consider iterative solvers for strongly anisotropic PDEs which arise in many problems in geophysical modelling in “flat” domains, such as numerical weatherand climate prediction (NWP), global ocean models or subsurface reservoirand flowsimulations. For example, an equation for the pressure correction has to be solved in a thin spherial shell representing the earth’s atmosphere at every timestep in many NWP codes. To improve the accuracy of the model, the spatial resolution is continuously increased and this leads to significant computational challenges as forecasts have to be delivered on operational timescales.
منابع مشابه
Petascale elliptic solvers for anisotropic PDEs on GPU clusters
Memory bound applications such as solvers for large sparse systems of equations remain a challenge for GPUs. Fast solvers should be based on numerically efficient algorithms and implemented such that global memory access is minimised. To solve systems with up to one trillion (10) unknowns the code has to make efficient use of several million individual processor cores on large GPU clusters. We ...
متن کاملMatrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs
Many problems in geophysical and atmospheric modelling require the fast solution of elliptic partial differential equations (PDEs) in “flat” three dimensional geometries. In particular, an anisotropic elliptic PDE for the pressure correction has to be solved at every time step in the dynamical core of many numerical weather prediction (NWP) models, and equations of a very similar structure aris...
متن کاملExploiting Batch Processing on Streaming Architectures to Solve 2D Elliptic Finite Element Problems: A Hybridized Discontinuous Galerkin (HDG) Case Study
Numerical methods for elliptic partial differential equations (PDEs) within both continuous (CG) and hybridized discontinuous Galerkin (HDG) frameworks share the same general structure: local (elemental) matrix generation followed by a global linear system assembly and solve. The lack of inter-element communication and easily parallelizable nature of the local matrix generation stage coupled wi...
متن کاملA Scala prototype to generate multigrid solver implementations for different problems and target multi-core platforms
Many problems in computational science and engineering involve partial differential equations and thus require the numerical solution of large, sparse (non)linear systems of equations. Multigrid is known to be one of the most efficient methods for this purpose. However, the concrete multigrid algorithm and its implementation highly depend on the underlying problem and hardware. Therefore, chang...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کامل